Probabilistic Routing Based on Two-Hop Information in Delay/Disruption Tolerant Networks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Link-Reliability Based Two-Hop Routing for Wireless Sensor Networks

Wireless sensor networks (WSNs) emerge as underlying infrastructures for new classes of large scale networked embedded systems. However, WSNs system designers must fulfill the Quality-of-Service (QoS) requirements imposed by the applications (and users). Very harsh and dynamic physical environments and extremely limited energy/computing/memory/communication node resources are major obstacles fo...

متن کامل

Beaconing-Aware Optimal Policies for Two-Hop Routing in Multi-Class Delay Tolerant Networks

In Delay Tolerant Networks (DTNs), two-hop routing compromises energy versus delay more conveniently than epidemic routing. Literature provides comprehensive results on optimal routing policies for mobile nodes with homogeneous mobility, often neglecting signaling costs. Routing policies are customarily computed by means of fluid approximation techniques, which assure solutions to be optimal on...

متن کامل

Estimating File-Spread in Delay Tolerant Networks under Two-Hop Routing

We consider a Delay/Disruption Tolerant Network under two-hop routing. Our objective is to estimate and track the degree of spread of a message/file in the network. Indeed, having such real-time information is critical for on-line control of routing and energy expenditure. It also benefits the multi-casting application. With exponential inter-meeting times of mobile nodes: (i) for the estimatio...

متن کامل

Competition and Cooperation between Nodes in Delay Tolerant Networks with Two Hop Routing

This paper revisits the two-hop forwarding policy in delay tolerant networks (DTNs) and provides a rich study of their performance and optimization which includes (i) Derivation of closed form expressions for the main performance measures such as success delivery probability of a packet (or a message) within a given deadline. (ii) A study of competitive and cooperative operations of DTNs and de...

متن کامل

Universal scheme improving probabilistic routing in delay-tolerant networks

Many application protocols designed for the Internet architecture cannot operate well in challenged network environments. The communication in a delay-tolerant networking architecture, which is characterized by very long delay paths and frequent network partitions, basically relies on asynchronous, store-carry-forward message delivery. In most of the existing probabilistic routing approaches, m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Electrical and Computer Engineering

سال: 2015

ISSN: 2090-0147,2090-0155

DOI: 10.1155/2015/918065